Intelligent Mapping of Hyperspace
نویسندگان
چکیده
This paper addresses some particular issues related to the difficult task of automatically structuring information available in ill-structured environments, through a distributed hypermedia system like the Web. We present an original approach to this problem, which coordinates different aspects of automatic computation of relations between nodes in hyperspace, through dynamic linking, using intelligent mapping of the domain material, by the application of spatial reasoning. We present a multi-purpose framework to dynamically structure information in the Web and a proof-of-concept prototype, dubbed Hypermap, implemented to build the spatial cognitive maps of the hyperspace, inspired by the human cognitive mapping process.
منابع مشابه
An Adaptive Hypermedia System
Hypermedia systems are information tools that allow flexible navigation through several topics. This approach is being increasingly used in educational environments. However, these systems have disadvantages: if the hyperspace is big enough (and usually it is), the users become overwhelmed by the amount of paths and topics available, and get lost in the hyperspace losing even the benefits of li...
متن کاملIntelligent Mapping
This paper is directed to the question of how to model and design an efficient tool for the intelligent mapping which is based on both dynamic and efficient storage of data and soft computing. The former is performed by our method that learns how to store, search and delete the data. After pointing out the limitation of the crisp evaluation of the distance between two points, we argue in favor ...
متن کاملRemapping Subpartitions of Hyperspace Using Iterative Genetic Search Remapping Subpartitions of Hyperspace Using Iterative Genetic Search Remapping Subpartitions of Hyperspace Using Iterative Genetic Search
Various strategies for remapping hyperspace associated with two iterative genetic algorithms are reviewed, compared and empirically tested on a particular \real-world" problem. Both algorithms reduce the hypercube at each iteration such that each new mapping samples only subpartitions of the search space. Delta coding remaps the search space at each iteration by sampling the subspace numericall...
متن کاملOn some properties of the hyperspace $theta (X)$ and the study of the space $downarrowtheta C(X)$
The aim of the paper is to first investigate some properties of the hyperspace $theta(X)$, and then in the next article it deals with some detailed study of a special type of subspace $downarrowtheta C(X)$ of the space $theta (Xtimes mathbb I)$.
متن کاملChaos on Hyperspace
In this paper, the chaotic behavior of a set-valued mapping F : X → 2 , where X is a compact space, is investigated. The existence of the generalized shadowing property in the hyperspace 2 is proved. Based on the generalized shadowing property of the set-valued mappings F and the assumption of the existence of an unstable chain recurrent point of the mapping F , it is shown that the Bernoulli s...
متن کامل